Maximal independent set - PDFSEARCH.IO - Document Search Engine

Maximal independent set
Results: 70

#	Item
51	LNCSA Continuous-Based Approach for Partial Clique Enumeration Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:12:13 NP-complete problems Graph operations Clique problem Clique Independent set Matching Networks Maximal independent set Cograph Graph theory Theoretical computer science Mathematics
52	Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2012-06-27 11:58:26 NP-complete problems Clique Matching Maximal independent set Independent set Circuit complexity Path decomposition Bipartite dimension Graph theory Theoretical computer science Mathematics
53	Sage Reference Manual: Matroid Theory Release 6.6.beta0 The Sage Development Team Add to Reading List Source URL: sagemath.org Language: English - Date: 2015-02-21 07:35:22 Combinatorics Matroid Duality Maximal independent set Biased graph Greedoid Matroid theory Mathematics Graph theory
54	To appear in 13th International Conference on Computer Vision, 6-13 November 2011, Barcelona, Spain. Image Segmentation by Figure-Ground Composition into Maximal Cliques Adrian Ion∗, Joao Carreira, Cristian Sminchises Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2014-06-04 23:25:00 Applied mathematics Image processing Segmentation Geometry Tessellation Market segmentation Clique problem Clique Independent set Mathematics Tiling NP-complete problems
55	This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings Completion Delay Minimization for Instantly Decodable Networ Add to Reading List Source URL: www.comm.utoronto.ca Language: English - Date: 2011-12-23 16:23:54 NP-complete problems Clique Network coding Shortest path problem Maximal independent set Path decomposition Graph theory Theoretical computer science Mathematics
56	Annals of Mathematics, [removed]), 439–485 On the hardness of approximating minimum vertex cover By Irit Dinur and Samuel Safra* Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2006-04-11 06:21:40 NP-complete problems Vertex cover Independent set NP-complete NP PCP theorem Maximal independent set Power set P versus NP problem Theoretical computer science Mathematics Computational complexity theory
57	doi:[removed]j.tcs[removed] Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:39:01 Graph operations Clique Bron–Kerbosch algorithm Maximal independent set Independent set Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems
58	Data Mining and Knowledge Discovery in Dynamic Networks Panos M. Pardalos Center for Applied Optimization Dept. of Industrial & Systems Engineering Add to Reading List Source URL: www.eecs.harvard.edu Language: English - Date: 2006-10-30 15:12:10 Independent set Graph operations Graph Maximal independent set Clique problem Graph theory NP-complete problems Clique
59	A new trust region technique for the maximum weight clique problem Stanislav Busygin Industrial and Systems Engineering Department, University of Florida, 303 Weil Hall, Gainesville, FL 32611, USA Add to Reading List Source URL: www.stasbusygin.org Language: English - Date: 2009-02-11 00:35:51 NP-complete problems Clique Independent set Maximal independent set Tree decomposition Path decomposition Graph theory Theoretical computer science Mathematics
60	A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics ∗ Stanislav Busygin [removed] http://www.stasbusygin.org Add to Reading List Source URL: www.stasbusygin.org Language: English - Date: 2009-02-11 00:35:51 Graph operations Graph coloring Clique problem Clique Independent set Neighbourhood Degree Path decomposition Maximal independent set Graph theory Theoretical computer science NP-complete problems

UPDATE